Achievable rate regions for a three-user multiple access channel with partial side information
نویسندگان
چکیده
A generalisation of the Gaussian doubly dirty multiple access channel to a Gaussian triply dirty multiple access channel (GTD-MAC) is considered, where there are three additive interference signals, each one non-causally known to only associated transmitter. Same as in the Gaussian doubly dirty multiple access channel, Costa’s strategy (i.e. random binning scheme) cannot achieve positive rates in the limit of strong interferences. In contrast, it is shown that positive rates independent of the interferences can be achieved by lattice strategies. In fact in some cases—which depend on the noise variance and power constraints—lattice strategies are optimal, in particular, in the high signal-to-noise ratio (SNR) regime. For the GTD-MAC, two models are considered, full side information and partial side information at the transmitters. The results show that partiality in side information reduces the achievable rates as numerical illustrations confirm. Also, the results for the GTD-MAC can be extended to the K-user case. Copyright © 2013 John Wiley & Sons, Ltd.
منابع مشابه
Achievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel
In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...
متن کاملOn the Achievable Rate-Regions for the Gaussian Two-way Diamond Channels
In this channel,we study rate region of a Gaussian two-way diamond channel which operates in half-duplex mode. In this channel, two transceiver (TR) nodes exchange their messages with the help of two relay nodes. We consider a special case of the Gaussian two-way diamond channels which is called Compute-and-Forward Multiple Access Channel (CF-MAC). In the CF-MAC, the TR nodes transmit their mes...
متن کاملGaussian doubly dirty compound multiple-access channel with partial side information at the transmitters
In this study, the authors study a two-user Gaussian doubly dirty compound multiple-access channel with partial side information (GDD-CMAC-PSI) where two independent additive interference signals are considered, each one known noncausally and partially to one of the encoders but unknown to either of the receivers. This channel, first, can model two users communicating with two base stations suf...
متن کاملExtension of the Coverage Region of Multiple Access Channels by Using a Relay
From practical and theoretical viewpoints, performance analysis of communication systems by using information-theoretic results is important. In this paper, based on our previous work on Multiple Access Channel (MAC) and Multiple Access Relay Channel (MARC), we analyze the impact of a relay on the fundamental wireless communications concept, i.e., coverage region of MARC, as a basic model for u...
متن کاملGeneralizing Multiple Access Wiretap and Wiretap II Channel Models: Achievable Rates and Cost of Strong Secrecy
In this paper, new two-user multiple access wiretap channel models are studied. First, the multiple access wiretap channel II with a discrete memoryless main channel, under three different wiretapping scenarios, is introduced. The wiretapper, as in the classical wiretap channel II model, chooses a fixedlength subset of the channel uses on which she obtains noise-free observations of one of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Trans. Emerging Telecommunications Technologies
دوره 26 شماره
صفحات -
تاریخ انتشار 2015